Computer analysis of optokinetic nystagmus by principal component analysis.
نویسندگان
چکیده
منابع مشابه
Compression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کاملCompression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کاملHuman optokinetic nystagmus: a stochastic analysis.
Optokinetic nystagmus (OKN) is a fundamental gaze-stabilizing response found in almost all vertebrates, in which eye movements attempt to compensate for the optic flow caused by self-motion. It is an alternating sequence of slow compensatory eye movements made in the direction of stimulus motion and fast eye movements made predominantly in the opposite direction. The timing and amplitude of the...
متن کاملRobust Principal Component Analysis for Computer Vision
Principal Component Analysis (PCA) has been widely used for the representation of shape, appearance, and motion. One drawback of typical PCA methods is that they are least squares estimation techniques and hence fail to account for “outliers” which are common in realistic training sets. In computer vision applications, outliers typically occur within a sample (image) due to pixels that are corr...
متن کاملROBUST PRINCIPAL COMPONENT ANALYSIS? By
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nippon Jibiinkoka Gakkai Kaiho
سال: 1987
ISSN: 0030-6622,1883-0854
DOI: 10.3950/jibiinkoka.90.687